Convex normal functions revisited

نویسندگان

  • John Harding
  • Carol L. Walker
  • Elbert A. Walker
چکیده

The lattice Lu of upper semicontinuous convex normal functions with convolution ordering arises in studies of type-2 fuzzy sets. In 2002, Kawaguchi and Miyakoshi [Extended t-norms as logical connectives of fuzzy truth values, Multiple-Valued Logic 8(1) (2002) 53–69] showed that this lattice is a complete Heyting algebra. Later, Harding et al. [Lattices of convex, normal functions, Fuzzy Sets and Systems 159 (2008) 1061–1071] gave an improved description of this lattice and showed it was a continuous lattice in the sense of Gierz et al. [A Compendium of Continuous Lattices, Springer, Berlin, 1980]. In this note we show the lattice Lu is isomorphic to the lattice of decreasing functions from the real unit interval [0, 1] to the interval [0, 2] under pointwise ordering, modulo equivalence almost everywhere. This allows development of further properties of Lu . It is shown that Lu is completely distributive, is a compact Hausdorff topological lattice whose topology is induced by a metric, and is self-dual via a period two antiautomorphism. We also show the lattice Lu has another realization of natural interest in studies of type-2 fuzzy sets. It is isomorphic to a quotient of the lattice L of all convex normal functions under the convolution ordering. This quotient identifies two convex normal functions if they agree almost everywhere and their intervals of increase and decrease agree almost everywhere. © 2008 Elsevier B.V. All rights reserved. MSC: 06B10; 06B15

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED

Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

Hermite-Hadamard inequalities for $mathbb{B}$-convex and $mathbb{B}^{-1}$-convex functions

Hermite-Hadamard inequality is one of the fundamental applications of convex functions in Theory of Inequality. In this paper, Hermite-Hadamard inequalities for $mathbb{B}$-convex and $mathbb{B}^{-1}$-convex functions are proven.

متن کامل

Bernstein's polynomials for convex functions and related results

In this paper we establish several polynomials similar to Bernstein's polynomials and several refinements of  Hermite-Hadamard inequality for convex functions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fuzzy Sets and Systems

دوره 161  شماره 

صفحات  -

تاریخ انتشار 2010